A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence
نویسندگان
چکیده
We present a new linear systolic array architecture of m cells which outputs a longest common subsequence (LCS) of two input strings A and B in time n + 2m, where n and m denote the lengths of A and B respectively (m < n). Our approach improves the time of execution required by previous linear systolic arrays for this purpose. Furthermore, a design combining a tree with the linear array provides an LCS and its length in n + m + log m clock cycles only. @ 1997 Elsevier Science B.V.
منابع مشابه
A Scalable and Efficient Systolic Algorithm for the Longest Common Subsequence Problem
A longest common subsequence (LCS) of two strings is a common subsequence of two strings of maximal length. The LCS problem is that of finding an LCS of two given strings and the length of the LCS. This problem has been the subject of much research because its solution can be applied in many areas. In this paper, a scalable and efficient systolic algorithm is presented. For two given strings of...
متن کاملA New Practical Linear Space Algorithm for the Longest Common Subsequence Problem
This paper deals with a new practical method for solving the longest common subsequence (LCS) problem. Given two strings of lengths m and n, n ≥ m, on an alphabet of size s, we first present an algorithm which determines the length p of an LCS in O(ns + min{mp, p(n − p)}) time and O(ns) space. This result has been achieved before [Ric94, Ric95], but our algorithm is significantly faster than pr...
متن کاملFaster subsequence recognition in compressed strings
Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel–Ziv compression. For an SLPcompressed text of length m̄, and an uncompressed pattern of length n, Cégielski et al. gave an algorithm for local subsequence recogn...
متن کاملEfficient Dominant Point Algorithms for the Multiple Longest Common Subsequence (MLCS) Problem
Finding the longest common subsequence of multiple strings is a classical computer science problem and has many applications in the areas of bioinformatics and computational genomics. In this paper, we present a new sequential algorithm for the general case of MLCS problem, and its parallel realization. The algorithm is based on the dominant point approach and employs a fast divide-and-conquer ...
متن کاملQuadratic-time Algorithm for the String Constrained LCS Problem
The problem of finding a longest common subsequence of two main sequences with some constraint that must be a substring of the result (STR-IC-LCS) was formulated recently. It is a variant of the constrained longest common subsequence problem. As the known algorithms for the STR-IC-LCS problem are cubic-time, the presented quadratic-time algorithm is significantly faster.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 61 شماره
صفحات -
تاریخ انتشار 1997